Decomposition and Moser’s lemma
نویسندگان
چکیده
منابع مشابه
Decomposition and Moser’s Lemma
Using the idea of the optimal decomposition developed in recent papers [EK2] by the same authors and in [CUK] we study the boundedness of the operator Tg(x) = ∫ 1 x g(u) du/u, x ∈ (0, 1), and its logarithmic variant between Lorentz spaces and exponential Orlicz and Lorentz-Orlicz spaces. These operators are naturally linked with Moser’s lemma, O’Neil’s convolution inequality, and estimates for ...
متن کاملOn Friedrichs inequality, Helmholtz decomposition, vector potentials, and the div-curl lemma
We study connections between four different types of results that are concerned with vector-valued functions u : Ω → R of class L(Ω) on a domain Ω ⊂ R: Coercivity results in H(Ω) relying on div and curl, the Helmholtz decomposition, the construction of vector potentials, and the global div-curl lemma. Key-words: Friedrichs inquality, coercivity, div-curl lemma, compensated compactness
متن کاملA Skorohod-type Lemma and a Decomposition of Reflected Brownian Motion Krzysztof Burdzy
We consider 2-dimensional reflected Brownian motions in sharp thorns pointed downward with horizontal vectors of reflection. We present a decomposition of the process into a Brownian motion and a process which has bounded variation away from the tip of the thorn. The construction is based on a new Skorohod-type lemma.
متن کاملRegular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
Let D(n)(D(n, k)) denote the maximum possible d such that there exists a d-regular hypergraph (d-regular k-uniform hypergraph, respectively) on n vertices containing no proper regular spanning subhypergraph. The problem of estimating D(n) arises in Game Theory and Huckemann and Jurkat were the first to prove that it is finite. Here we give two new simple proofs that D(n), D(n, k) are finite, an...
متن کاملPumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Complutense
سال: 2002
ISSN: 1988-2807,1139-1138
DOI: 10.5209/rev_rema.2002.v15.n1.16943